A Characterization of the Single-Peaked Single-Crossing Domain
نویسندگان
چکیده
We investigate elections that are simultaneously singlepeaked and single-crossing (SPSC). We show that the domain of 1-dimensional Euclidean elections (where voters and candidates are points on the real line, and each voter prefers the candidates that are close to her to the ones that are further away) is a proper subdomain of the SPSC domain, by constructing an election that is single-peaked and singlecrossing, but not 1-Euclidean. We then establish a connection between narcissistic elections (where each candidate is ranked first by at least one voter), single-peaked elections and single-crossing elections, by showing that an election is SPSC if and only if it can be obtained from a narcissistic singlecrossing election by deleting voters. We show two applications of our characterization.
منابع مشابه
The Single-Peaked Domain Revisited: A Simple Global Characterization
It is proved that, among all restricted preference domains that guarantee consistency (i.e. transitivity) of pairwise majority voting, the single-peaked domain is the only minimally rich and connected domain that contains two completely reversed strict preference orders. It is argued that this result explains the predominant role of single-peakedness as a domain restriction in models of politic...
متن کاملOrdinal Bayesian incentive compatibility in restricted domains
We study deterministic voting mechanisms by considering an ordinal notion of Bayesian incentive compatibility (OBIC). If the beliefs of agents are independent and generic, we show that a mechanism is OBIC and satisfies an additional condition called elementary monotonicity if and only if it is a dominant strategy incentive compatible mechanism. Our result works in a large class of preference do...
متن کاملA Characterization of Single-Peaked Preferences via Random Social Choice Functions
The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function satisfying these properties. Single-peakedness is defined with respect to arbitrary trees. We also show ...
متن کاملA characterization of the single-peaked domain
We provide in this paper a pair of properties that are both necessary and sufficient to characterize the domain of single-peaked preference profiles. This characterization allows for a definition of single-peaked preference profiles without using an ad-hoc unlerlying order of the alternatives and also sheds light on the structure of single-peaked profiles. Considering the larger domain of value...
متن کاملPreference Elicitation for Single Crossing Domain
Eliciting the preferences of a set of agents over a set of alternatives is a problem of fundamental importance in social choice theory. Prior work on this problem has studied the query complexity of preference elicitation for the unrestricted domain and for the domain of single peaked preferences. In this paper, we consider the domain of single crossing preference profiles and study the query c...
متن کامل